https://ogma.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:26288 v∈N(v)l(v) + d(u), where d(u) denotes the degree of u and N(u) denotes the open neighborhood of u. In this paper we introduce a new labeling called d-lucky labeling and study the same as a vertex coloring problem. We define a labeling l as d-lucky if c(u) ≠ c(v), for every pair of adjacent vertices u and v in G. The d-lucky number of a graph G, denoted by η_dl(G), is the least positive k such that G has a d-lucky labeling with {1,2,...,k} as the set of labels. We obtain η_dl(G) = 2 for hypercube network, butterfly network, benes network, mesh network, hypertree and X-tree.]]> Wed 11 Apr 2018 16:49:46 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:35653 Wed 02 Oct 2019 10:01:58 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:29436 Sat 24 Mar 2018 07:39:19 AEDT ]]>